A Single Queue with Mutually Replacing m Servers
نویسندگان
چکیده
منابع مشابه
A Single Queue with Mutually Replacing m Servers
Abstract Customers arriving in a Poisson stream are served one by one exponentially by one of them servers S 1, S 2, S 3, . . . , Sm. A server who has just completed a service either continues the next service or is replaced by another server. The replacement of a server at each service completion is governed by a probabilistic criterion of availability of servers. Transient solutions in terms ...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملThe M/M/c Queue with Setup Times and Single Working Vacations of Partial Servers
In this paper, we investigate an M/M/c queue with single working vacations of partial servers and setup times. During the vacation period, some of which servers are not entirely stop the service but service the new customers at a lower service rate, the other servers have a normal vacation and stop the service. Quasi-birth-and-death-process and infinitesimal generators for the process are obtai...
متن کاملA tollbooth tandem queue with heterogeneous servers
We study a tandem queueing system with K servers and no waiting space in between. A customer needs service from one server but can leave the system only if all down-stream servers are unoccupied. Such a system is often observed in toll collection during rush hours in transportation networks, and we call it a tollbooth tandem queue. We apply matrix-analytic methods to study this queueing system,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2011
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v3n1p3